Automated Proofs in Geometry : Computing Upper Bounds for the Heilbronn Problem for Triangles
نویسندگان
چکیده
The Heilbronn problem for triangle[Wei] is defined as follows: place N points inside a triangle of unit area, so as to maximize the area of the smallest triangle obtained by choosing 3 points among N. Several authors worked towards finding lower bounds or optimal configurations of points. In this paper, we propose upper bounds for those problems, obtained by a method of automated theorem proving.
منابع مشابه
A Duality between Small-Face Problems in Arrangements of Lines and Heilbronn-Type Problems
Arrangements of lines in the plane and algorithms for computing extreme features of arrangements are a major topic in computational geometry. Theoretical bounds on the size of these features are also of great interest. Heilbronn’s triangle problem is one of the famous problems in discrete geometry. In this paper we show a duality between extreme (small) face problems in line arrangements (bound...
متن کاملA bi-level linear programming problem for computing the nadir point in MOLP
Computing the exact ideal and nadir criterion values is a very important subject in multi-objective linear programming (MOLP) problems. In fact, these values define the ideal and nadir points as lower and upper bounds on the nondominated points. Whereas determining the ideal point is an easy work, because it is equivalent to optimize a convex function (linear function) over a con...
متن کاملExact maximum coverage probabilities of confidence intervals with increasing bounds for Poisson distribution mean
A Poisson distribution is well used as a standard model for analyzing count data. So the Poisson distribution parameter estimation is widely applied in practice. Providing accurate confidence intervals for the discrete distribution parameters is very difficult. So far, many asymptotic confidence intervals for the mean of Poisson distribution is provided. It is known that the coverag...
متن کاملSimilar Triangles, Another Trace of the Golden Ratio
In this paper we investigate similar triangles which are not congruent but have two pair congruent sides. We show that greatest lower bound of values for similarity ratio of such triangles is golden ratio. For right triangles, we prove that the supremum of values for similarity ratio is the square root of the golden ratio.
متن کاملA note on the bounds of Laplacian-energy-like-invariant
The Laplacian-energy-like of a simple connected graph G is defined as LEL:=LEL(G)=∑_(i=1)^n√(μ_i ), Where μ_1 (G)≥μ_2 (G)≥⋯≥μ_n (G)=0 are the Laplacian eigenvalues of the graph G. Some upper and lower bounds for LEL are presented in this note. Moreover, throughout this work, some results related to lower bound of spectral radius of graph are obtained using the term of ΔG as the num...
متن کامل